0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.35	% Computer   : n008.cluster.edu
0.15/0.35	% Model      : x86_64 x86_64
0.15/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory     : 8042.1875MB
0.15/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit   : 1200
0.15/0.35	% WCLimit    : 120
0.15/0.35	% DateTime   : Tue Jul 13 13:42:44 EDT 2021
0.15/0.35	% CPUTime    : 
0.15/0.35	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.36	# Version: 2.6rc1-ho
0.15/0.36	# No SInE strategy applied
0.15/0.36	# Trying AutoSched0 for 59 seconds
0.21/0.42	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.21/0.42	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.42	#
0.21/0.42	# Preprocessing time       : 0.051 s
0.21/0.42	
0.21/0.42	# Proof found!
0.21/0.42	# SZS status Theorem
0.21/0.42	# SZS output start CNFRefutation
0.21/0.42	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.21/0.42	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.21/0.42	thf(def_n_is, axiom, (n_is)=(^[X414:$i, X415:$i]:(X414)=(X415)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.21/0.42	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.21/0.42	thf(satz4e, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz4e)).
0.21/0.42	thf(satz4a, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:n_is @ (n_pl @ X1 @ n_1) @ (ordsucc @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz4a)).
0.21/0.42	thf(c_0_6, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.21/0.42	thf(c_0_7, axiom, (n_is)=(^[X414:$i, X415:$i]:(X414)=(X415)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.21/0.42	thf(c_0_8, negated_conjecture, ~(![X628:$i]:(in @ X628 @ nat=>(ordsucc @ X628)=(n_pl @ X628 @ n_1))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz4e]), c_0_6]), c_0_7])).
0.21/0.42	thf(c_0_9, plain, ![X684:$i]:(in @ X684 @ nat=>(n_pl @ X684 @ n_1)=(ordsucc @ X684)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4a, c_0_6]), c_0_7])).
0.21/0.42	thf(c_0_10, negated_conjecture, (in @ esk40_0 @ nat&(ordsucc @ esk40_0)!=(n_pl @ esk40_0 @ n_1)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
0.21/0.42	thf(c_0_11, plain, ![X1090:$i]:(~in @ X1090 @ nat|(n_pl @ X1090 @ n_1)=(ordsucc @ X1090)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
0.21/0.42	thf(c_0_12, negated_conjecture, (ordsucc @ esk40_0)!=(n_pl @ esk40_0 @ n_1), inference(split_conjunct,[status(thm)],[c_0_10])).
0.21/0.42	thf(c_0_13, plain, ![X1:$i]:((n_pl @ X1 @ n_1)=(ordsucc @ X1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_11])).
0.21/0.42	thf(c_0_14, negated_conjecture, in @ esk40_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_10])).
0.21/0.42	thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']).
0.21/0.42	# SZS output end CNFRefutation
0.21/0.42	# Proof object total steps             : 16
0.21/0.42	# Proof object clause steps            : 4
0.21/0.42	# Proof object formula steps           : 12
0.21/0.42	# Proof object conjectures             : 6
0.21/0.42	# Proof object clause conjectures      : 3
0.21/0.42	# Proof object formula conjectures     : 3
0.21/0.42	# Proof object initial clauses used    : 3
0.21/0.42	# Proof object initial formulas used   : 6
0.21/0.42	# Proof object generating inferences   : 1
0.21/0.42	# Proof object simplifying inferences  : 2
0.21/0.42	# Training examples: 0 positive, 0 negative
0.21/0.42	# Parsed axioms                        : 311
0.21/0.42	# Removed by relevancy pruning/SinE    : 0
0.21/0.42	# Initial clauses                      : 419
0.21/0.42	# Removed in clause preprocessing      : 139
0.21/0.42	# Initial clauses in saturation        : 280
0.21/0.42	# Processed clauses                    : 14
0.21/0.42	# ...of these trivial                  : 0
0.21/0.42	# ...subsumed                          : 0
0.21/0.42	# ...remaining for further processing  : 14
0.21/0.42	# Other redundant clauses eliminated   : 0
0.21/0.42	# Clauses deleted for lack of memory   : 0
0.21/0.42	# Backward-subsumed                    : 0
0.21/0.42	# Backward-rewritten                   : 0
0.21/0.42	# Generated clauses                    : 6
0.21/0.42	# ...of the previous two non-trivial   : 5
0.21/0.42	# Contextual simplify-reflections      : 0
0.21/0.42	# Paramodulations                      : 3
0.21/0.42	# Factorizations                       : 0
0.21/0.42	# NegExts                              : 0
0.21/0.42	# Equation resolutions                 : 0
0.21/0.42	# Propositional unsat checks           : 0
0.21/0.42	#    Propositional check models        : 0
0.21/0.42	#    Propositional check unsatisfiable : 0
0.21/0.42	#    Propositional clauses             : 0
0.21/0.42	#    Propositional clauses after purity: 0
0.21/0.42	#    Propositional unsat core size     : 0
0.21/0.42	#    Propositional preprocessing time  : 0.000
0.21/0.42	#    Propositional encoding time       : 0.000
0.21/0.42	#    Propositional solver time         : 0.000
0.21/0.42	#    Success case prop preproc time    : 0.000
0.21/0.42	#    Success case prop encoding time   : 0.000
0.21/0.42	#    Success case prop solver time     : 0.000
0.21/0.42	# Current number of processed clauses  : 14
0.21/0.42	#    Positive orientable unit clauses  : 7
0.21/0.42	#    Positive unorientable unit clauses: 0
0.21/0.42	#    Negative unit clauses             : 3
0.21/0.42	#    Non-unit-clauses                  : 4
0.21/0.42	# Current number of unprocessed clauses: 271
0.21/0.42	# ...number of literals in the above   : 711
0.21/0.42	# Current number of archived formulas  : 0
0.21/0.42	# Current number of archived clauses   : 0
0.21/0.42	# Clause-clause subsumption calls (NU) : 1
0.21/0.42	# Rec. Clause-clause subsumption calls : 1
0.21/0.42	# Non-unit clause-clause subsumptions  : 0
0.21/0.42	# Unit Clause-clause subsumption calls : 3
0.21/0.42	# Rewrite failures with RHS unbound    : 0
0.21/0.42	# BW rewrite match attempts            : 0
0.21/0.42	# BW rewrite match successes           : 0
0.21/0.42	# Condensation attempts                : 0
0.21/0.42	# Condensation successes               : 0
0.21/0.42	# Termbank termtop insertions          : 32822
0.21/0.42	
0.21/0.42	# -------------------------------------------------
0.21/0.42	# User time                : 0.052 s
0.21/0.42	# System time              : 0.008 s
0.21/0.42	# Total time               : 0.060 s
0.21/0.42	# Maximum resident set size: 2068 pages
0.21/0.42	EOF